Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 66 matches
- 2024
- Magda Dettlaff, Michael A. Henning, Jerzy Topp:
Common domination perfect graphs. Discret. Appl. Math. 342: 253-259 (2024) - 2023
- Vinicius Leal do Forte, Saïd Hanafi, Abilio Lucena:
Extended formulations for perfect domination problems and their algorithmic implications. Eur. J. Oper. Res. 310(2): 566-581 (2023) - Ahlam Almulhim:
Total Perfect Roman Domination. Symmetry 15(9): 1676 (2023) - Henning Fernau, Kevin Mann:
Perfect Roman Domination and Unique Response Roman Domination. CoRR abs/2309.07018 (2023) - 2022
- Yunfan Zhao, John C. Wierman, Thomas G. Marge:
Perfect Domination Ratios of Archimedean Lattices. Electron. J. Comb. 29(3) (2022) - Dinabandhu Pradhan, S. Banerjee, Jia-Bao Liu:
Perfect Italian domination in graphs: Complexity and algorithms. Discret. Appl. Math. 319: 271-295 (2022) - Sakineh Nazari-Moghaddam, Mustapha Chellali:
A new upper bound for the perfect Italian domination number of a tree. Discuss. Math. Graph Theory 42(3): 1005-1022 (2022) - Abel Cabrera Martínez, Carlos García Gómez, Juan A. Rodríguez-Velázquez:
Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs. Fundam. Informaticae 185(3): 201-220 (2022) - Zehui Shao, Saeed Kosari, Hadi Rahbani, Mehdi Sharifzadeh, Seyed Mahmoud Sheikholeslami:
Strong equality of Roman and perfect Roman Domination in trees. RAIRO Oper. Res. 56(1): 381-394 (2022) - Nesrine Abbas:
Red Domination in Perfect Elimination Bipartite Graphs. CoRR abs/2203.10630 (2022) - Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Some New Results on Efficient and Perfect Edge Domination of Graphs. CoRR abs/2204.11785 (2022) - 2021
- S. Banerjee, Michael A. Henning, Dinabandhu Pradhan:
Perfect Italian domination in cographs. Appl. Math. Comput. 391: 125703 (2021) - Sergio Bermudo, Magda Dettlaff, Magdalena Lemanska:
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number. Discret. Appl. Math. 304: 153-163 (2021) - Abel Cabrera Martínez, Carlos García Gómez, Juan Alberto Rodríguez-Velázquez:
Perfect domination, Roman domination and perfect Roman domination in lexicographic product graphs. CoRR abs/2101.02023 (2021) - 2020
- Jun Yue, Jiamei Song:
Note on the perfect Roman domination number of graphs. Appl. Math. Comput. 364 (2020) - Ayotunde T. Egunjobi, Teresa W. Haynes:
Perfect double Roman domination of trees. Discret. Appl. Math. 284: 71-85 (2020) - Juho Lauri, Christodoulos Mitillos:
Perfect Italian domination on planar and regular graphs. Discret. Appl. Math. 285: 676-687 (2020) - Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Modelling and solving the perfect edge domination problem. Optim. Lett. 14(2): 369-394 (2020) - Xiaomeng Wang, Shou-Jun Xu, Xianyue Li:
Independent Perfect Domination Sets in Semi-Cayley Graphs. AAIM 2020: 436-447 - 2019
- Teresa W. Haynes, Michael A. Henning:
Perfect Italian domination in trees. Discret. Appl. Math. 260: 164-177 (2019) - Mahsa Darkooti, Abdollah Alhevaz, Sadegh Rahimi, Hadi Rahbani:
On perfect Roman domination number in trees: complexity and bounds. J. Comb. Optim. 38(3): 712-720 (2019) - S. Banerjee, J. Mark Keil, Dinabandhu Pradhan:
Perfect Roman domination in graphs. Theor. Comput. Sci. 796: 1-21 (2019) - Juho Lauri, Christodoulos Mitillos:
Perfect Italian domination on planar and regular graphs. CoRR abs/1905.06293 (2019) - 2018
- Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Perfect edge domination: hard and solvable cases. Ann. Oper. Res. 264(1-2): 287-305 (2018) - Michael A. Henning, William F. Klostermeyer, Gary MacGillivray:
Perfect Roman domination in trees. Discret. Appl. Math. 236: 235-245 (2018) - Luis R. Fuentes, Italo J. Dejter, Carlos A. Araújo:
Rainbow perfect domination in lattice graphs. Electron. J. Graph Theory Appl. 6(1): 95-112 (2018) - Teresa W. Haynes, Michael A. Henning:
Perfect graphs involving semitotal and semipaired domination. J. Comb. Optim. 36(2): 416-433 (2018) - 2017
- Eglantine Camby, Fränk Plein:
A note on an induced subgraph characterization of domination perfect graphs. Discret. Appl. Math. 217: 711-717 (2017) - Minghui Jiang, Yong Zhang:
Perfect domination and small cycles. Discret. Math. Algorithms Appl. 9(3): 1750030:1-1750030:11 (2017) - Michael Dinitz, Naomi Ephraim:
Multicast Capacity Through Perfect Domination. CoRR abs/1702.03978 (2017)
skipping 36 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-21 21:59 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint